Structure and order structure in Abelian groups
نویسندگان
چکیده
منابع مشابه
THE STRUCTURE OF FINITE ABELIAN p-GROUPS BY THE ORDER OF THEIR SCHUR MULTIPLIERS
A well-known result of Green [4] shows for any finite p-group G of order p^n, there is an integer t(G) , say corank(G), such that |M(G)|=p^(1/2n(n-1)-t(G)) . Classifying all finite p-groups in terms of their corank, is still an open problem. In this paper we classify all finite abelian p-groups by their coranks.
متن کاملPseudoframe multiresolution structure on abelian locally compact groups
Let $G$ be a locally compact abelian group. The concept of a generalized multiresolution structure (GMS) in $L^2(G)$ is discussed which is a generalization of GMS in $L^2(mathbb{R})$. Basically a GMS in $L^2(G)$ consists of an increasing sequence of closed subspaces of $L^2(G)$ and a pseudoframe of translation type at each level. Also, the construction of affine frames for $L^2(G)$ bas...
متن کاملOn the Structure of Abelian/^-groups
A new kind of abelian p-gioup, called an A -group, is introduced. This class contains the totally projective groups and Warfield's S-groups as special cases. It also contains the V-groups recently classified by the author. These more general groups are classified by cardinal (numerical) invariants which include, but are not limited to, the Ulm-Kaplansky invariants. Thus the existing theory, as ...
متن کاملpseudoframe multiresolution structure on abelian locally compact groups
let $g$ be a locally compact abelian group. the concept of a generalized multiresolution structure (gms) in $l^2(g)$ is discussed which is a generalization of gms in $l^2(mathbb{r})$. basically a gms in $l^2(g)$ consists of an increasing sequence of closed subspaces of $l^2(g)$ and a pseudoframe of translation type at each level. also, the construction of affine frames for $l^2(g)$ bas...
متن کاملStructure computation and discrete logarithms in finite abelian p-groups
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig–Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for H without using a relation matrix. The problem of computing a basis for some or all of the Sylow p-subgroups of an arbitrary finite abelian group G is addres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1968
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-19-2-199-209